Date: Tue, 14 Jan 1997 20:13:31 GMT
Server: NCSA/1.5
MIME-version: 1.0
Content-type: text/html
Last-modified: Fri, 15 Nov 1996 22:20:26 GMT
Content-length: 19157

<title>
CSE331 -  Lecture Transparencies
</title>

<body>

<h1>CSE331 - Lecture Notes</h1>

<ul>

<li><!WA0><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide1.gif">Slide 1 Sieve of Eratosthenes (GIF format)</a>
<li><!WA1><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide2.gif">Slide 2 Linked Lists (GIF format)</a>
<li><!WA2><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide3.gif">Slide 3 Adding and Deleting Nodes (GIF format)</a>
<li><!WA3><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide4.gif">Slide 4 Linked List Example (GIF format)</a>
<li><!WA4><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide5.gif">Slide 5 Code for Linked List Maintenance (GIF format)</a>
<li><!WA5><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide6.gif">Slide 6 Doubly-Linked Lists (GIF format)</a>
<li><!WA6><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide7.gif">Slide 7 Stacks (GIF format)</a>
<li><!WA7><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide8.gif">Slide 8 Using Stacks in a Post-Fix Calculator (GIF format)</a>
<li><!WA8><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide9.gif">Slide 9 Queue Example (GIF format)</a>
<li><!WA9><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide10.gif">Slide 10 Implementing a Queue in C (GIF format)</a>
<li><!WA10><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide11.gif">Slide 11 Storing a Tree (GIF format)</a>
<li><!WA11><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide12.gif">Slide 12 Storing a Tree (GIF format)</a>
<li><!WA12><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide13.gif">Slide 13 Leftmost Child, Right Sibling (GIF format)</a>
<li><!WA13><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide14.gif">Slide 14 Every Tree is a Binary Tree (Kinda) (GIF format)</a>
<li><!WA14><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide15.gif">Slide 15 Sequential Representation (GIF format)</a>
<li><!WA15><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide16.gif">Slide 16 Order of Encountering Nodes (GIF format)</a>
<li><!WA16><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide17.gif">Slide 17 Traversing Binary Trees (GIF format)</a>
<li><!WA17><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide18.gif">Slide 18 Traversing Binary Trees (GIF format)</a>
<li><!WA18><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide19.gif">Slide 19 Marking a Ruler (GIF format)</a>
<li><!WA19><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide20.gif">Slide 20 Marking Order (GIF format)</a>
<li><!WA20><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide21.gif">Slide 21 Correct Nonrecursive Ruler Routine (GIF format)</a>
<li><!WA21><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide22.gif">Slide 22 Drawing Boxes with Recursion (GIF format)</a>
<li><!WA22><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide23.gif">Slide 23 Supporting Recursion in C (GIF format)</a>
<li><!WA23><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide24.gif">Slide 24 Replacing Recursion with Nonrecursion (GIF format)</a>
<li><!WA24><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide25.gif">Slide 25 Algorithm Complexity (GIF format)</a>
<li><!WA25><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide26.gif">Slide 26 An O(N) Algorithm (GIF format)</a>
<li><!WA26><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide27.gif">Slide 27 An O(LOG N) Algorithm (GIF format)</a>
<li><!WA27><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide28.gif">Slide 28 Divide-and-Conquer Complexity (GIF format)</a>
<li><!WA28><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide29.gif">Slide 29 An O(N2) Algorithm -- Bubble Sort (GIF format)</a>
<li><!WA29><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide30.gif">Slide 30 Bubble Sort Complexity (GIF format)</a>
<li><!WA30><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide31.gif">Slide 31 Selection Sort Example (GIF format)</a>
<li><!WA31><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide32.gif">Slide 32 Its Computation Complexity (GIF format)</a>
<li><!WA32><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide33.gif">Slide 33 Insertion Sort Example (GIF format)</a>
<li><!WA33><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide34.gif">Slide 34 Its Computational Complexity (GIF format)</a>
<li><!WA34><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide35.gif">Slide 35 Performance Comparisons (GIF format)</a>
<li><!WA35><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide36.gif">Slide 36 Dealing with Large Records (GIF format)</a>
<li><!WA36><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide37.gif">Slide 37 Dealing with Large Records with Pointers (GIF format)</a>
<li><!WA37><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide38.gif">Slide 38 Shellsort (GIF format)</a>
<li><!WA38><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide39.gif">Slide 39 More on Shellsort (GIF format)</a>
<li><!WA39><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide40.gif">Slide 40 Introduction to Quicksort (GIF format)</a>
<li><!WA40><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide41.gif">Slide 41 After One Partitioning Pass (GIF format)</a>
<li><!WA41><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide42.gif">Slide 42 More Complete Quicksort Routine (GIF format)</a>
<li><!WA42><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide43.gif">Slide 43 Quicksort Example (GIF format)</a>
<li><!WA43><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide44.gif">Slide 44 Small Partitions Resulting During Quicksort (GIF format)</a>
<li><!WA44><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide45.gif">Slide 45 Use Insertion Sort for Small FIles (GIF format)</a>
<li><!WA45><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide46.gif">Slide 46 Worstcase for Quicksort!! (GIF format)</a>
<li><!WA46><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide47.gif">Slide 47 Median-of-Three Partitioning (GIF format)</a>
<li><!WA47><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide48.gif">Slide 48 Remove the Recursion (GIF format)</a>
<li><!WA48><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide49.gif">Slide 49 Rank-Order Selection (GIF format)</a>
<li><!WA49><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide50.gif">Slide 50 Finding the Median Element (GIF format)</a>
<li><!WA50><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide51.gif">Slide 51 Find the kth Element in the Rank-Order (GIF format)</a>
<li><!WA51><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide52.gif">Slide 52 Extracting Bit-Fields (GIF format)</a>
<li><!WA52><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide53.gif">Slide 53 C Macros (GIF format)</a>
<li><!WA53><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide54.gif">Slide 54 Radix Exchange Example (GIF format)</a>
<li><!WA54><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide55.gif">Slide 55 Remainder of Example (GIF format)</a>
<li><!WA55><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide56.gif">Slide 56 Straight Radix Sorting Example (GIF format)</a>
<li><!WA56><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide57.gif">Slide 57 Distribution Counting Example (GIF format)</a>
<li><!WA57><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide58.gif">Slide 58 Straight Radix Sorting by Distributing Counting (GIF format)</a>
<li><!WA58><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide59.gif">Slide 59 Almost Sorted Arrays (GIF format)</a>
<li><!WA59><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide60.gif">Slide 60 Priority Queue Definition (GIF format)</a>
<li><!WA60><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide61.gif">Slide 61 An Implementation (GIF format)</a>
<li><!WA61><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide62.gif">Slide 62 Implementing "Insert" (GIF format)</a>
<li><!WA62><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide63.gif">Slide 63 Building a Heap "From Scratch" (GIF Format)</a>
<li><!WA63><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide64.gif">Slide 64 Implementing "Remove" (GIF format)</a>
<li><!WA64><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide65.gif">Slide 65 Sorting With Heaps (GIF format)</a>
<li><!WA65><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide65.5.gif">Slide 65.5 Bottom-Up Heap Construction (GIF format)</a>
<li><!WA66><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide66.gif">Slide 66 Heapsort Details (GIF format)</a>
<li><!WA67><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide67.gif">Slide 67 Complexity (GIF format)</a>
<li><!WA68><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide68.gif">Slide 68 Heaps Via Pointers (GIF format)</a>
<li><!WA69><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide69.gif">Slide 69 Heaps Via Pointers (GIF format)</a>
<li><!WA70><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide70.gif">Slide 70 Merging Example (GIF format)</a>
<li><!WA71><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide71.gif">Slide 71 Merging Two Linked Lists (GIF format)</a>
<li><!WA72><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide72.gif">Slide 72 Recursive Mergesort (GIF format)</a>
<li><!WA73><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide73.gif">Slide 73 Mergesort of Linked Lists (GIF Format)</a>
<li><!WA74><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide74.gif">Slide 74 Bottom-Up Mergesort Example (GIF format)</a>
<li><!WA75><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide75.gif">Slide 75 Bottom-Up Mergesort Example (GIF format)</a>
<li><!WA76><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide76.gif">Slide 76 Bottom-Up Mergesort Code (GIF format)</a>
<li><!WA77><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide77.gif">Slide 77 Continuing (GIF format)</a>
<li><!WA78><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide78.gif">Slide 78 Properties (GIF format)</a>
<li><!WA79><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide79.gif">Slide 79 Groundrules for External Sorting (GIF format)</a>
<li><!WA80><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide80.gif">Slide 80 Balanced Multiway Merging (GIF format)</a>
<li><!WA81><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide81.gif">Slide 81 Replacement Selection Example (GIF format)</a>
<li><!WA82><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide82.gif">Slide 82 Binary Search Example (GIF format)</a>
<li><!WA83><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide83.gif">Slide 83 Binary Search Code (GIF Format)</a>
<li><!WA84><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide84.gif">Slide 84 Binary Search Tree Representation (GIF format)</a>
<li><!WA85><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide85.gif">Slide 85 Binary Search Tree Routines (GIF format)</a>
<li><!WA86><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide86.gif">Slide 86 Inserting into a Binary Tree (GIF format)</a>
<li><!WA87><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide87.gif">Slide 87 A Property of Binary Search Trees (GIF format)</a>
<li><!WA88><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide88.gif">Slide 88 Unbalanced Search Trees (GIF format)</a>
<li><!WA89><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide89.gif">Slide 89 Components of 2-3-4 Trees (GIF format)</a>
<li><!WA90><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide90.gif">Slide 90 Searching in 2-3-4 Trees (GIF format)</a>
<li><!WA91><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide91.gif">Slide 91 Decomposing 4-nodes (GIF format)</a>
<li><!WA92><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide92.gif">Slide 92 Constructing a 2-3-4 Tree (GIF format)</a>
<li><!WA93><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide93.gif">Slide 93 Constructing a 2-3-4 Tree (GIF Format)</a>
<li><!WA94><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide94.gif">Slide 94 What Happens With Equal Keys? (GIF format)</a>
<li><!WA95><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide95.gif">Slide 95 Red-Black Trees. (GIF format)</a>
<li><!WA96><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide96.gif">Slide 96 Representing 2-3-4 Trees with R-B Trees (GIF format)</a>
<li><!WA97><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide97.gif">Slide 97 Equivalent 3-node Representations (GIF format)</a>
<li><!WA98><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide98.gif">Slide 98 4-Nodes in Red-Black Trees (GIF format)</a>
<li><!WA99><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide99.gif">Slide 99 Ramifications of Breaking-up 4-nodes (GIF format)</a>
<li><!WA100><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide100.gif">Slide 100 4-Node Break-Up Ramifications (GIF format)</a>
<li><!WA101><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide101.gif">Slide 101 4-Node Break-Up Ramifications (GIF format)</a>
<li><!WA102><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide102.gif">Slide 102 4-Node Break-Up Ramifications (GIF format)</a>
<li><!WA103><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide103.gif">Slide 103 4-Node Break-Up ramifications (GIF Format)</a>
<li><!WA104><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide104.gif">Slide 104 4-Node Break-Up Ramifications (GIF format)</a>
<li><!WA105><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide105.gif">Slide 105 The Rotate Routine (GIF format)</a>
<li><!WA106><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide106.gif">Slide 106 4-Node Break-Up at the Root (GIF format)</a>
<li><!WA107><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide107.gif">Slide 107 The 4-Node Split Routine (GIF format)</a>
<li><!WA108><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide108.gif">Slide 108 Searching in Red-Black Trees (GIF format)</a>
<li><!WA109><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide109.gif">Slide 109 Worstcase Insertion Order (GIF format)</a>
<li><!WA110><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide110.gif">Slide 110 Hashing Introduction (GIF format)</a>
<li><!WA111><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide111.gif">Slide 111 Hashing With Modulo Arithmetic (GIF format)</a>
<li><!WA112><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide112.gif">Slide 112 The Modulo Operation (GIF format)</a>
<li><!WA113><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide113.gif">Slide 113 Separate Chaining (GIF Format)</a>
<li><!WA114><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide114.gif">Slide 114 Linear Probing (GIF format)</a>
<li><!WA115><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide115.gif">Slide 115 Linear Probing Example (GIF format)</a>
<li><!WA116><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide116.gif">Slide 116 Double Hashing (GIF format)</a>
<li><!WA117><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide117.gif">Slide 117 Double Hashing Example (GIF format)</a>
<li><!WA118><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide118.gif">Slide 118 Linear Probe Statistics (GIF format)</a>
<li><!WA119><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide119.gif">Slide 119 Other Hashing Functions (GIF format)</a>
<li><!WA120><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide120.gif">Slide 120 Black-and-White Image Coding (GIF format)</a>
<li><!WA121><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide121.gif">Slide 121 Coded Image Example (GIF format)</a>
<li><!WA122><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide122.gif">Slide 122 Variable-Length Coding (GIF format)</a>
<li><!WA123><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide123.gif">Slide 123 Huffman Coding Example (GIF Format)</a>
<li><!WA124><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide124.gif">Slide 124 Continuing (GIF format)</a>
<li><!WA125><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide125.gif">Slide 125 Continuing (GIF format)</a>
<li><!WA126><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide126.gif">Slide 126 C.W. and C.C.W. Turns (GIF format)</a>
<li><!WA127><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide127.gif">Slide 127 Detecting C.C.W. Turns (GIF format)</a>
<li><!WA128><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide128.gif">Slide 128 Line Intersection Routine (GIF format)</a>
<li><!WA129><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide129.gif">Slide 129 A Poorman's Arctangent (GIF format)</a>
<li><!WA130><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide130.gif">Slide 130 Constructing Simple Closed Paths (GIF format)</a>
<li><!WA131><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide131.gif">Slide 131 Is A Given Point Inside A Polygon? (GIF format)</a>
<li><!WA132><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide132.gif">Slide 132 What Is This Routine Doing? (GIF format)</a>
<li><!WA133><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide200.gif">Slide 200 String Searching (Brute-Force Method) (GIF format)</a>
<li><!WA134><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide201.gif">Slide 201 Knuth-Morris-Pratt Algorithm (GIF format)</a>
<li><!WA135><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide202.gif">Slide 202 More On K-M-P Algorithm (GIF format)</a>
<li><!WA136><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide203.gif">Slide 203 Boyer-Moore Algorithm (GIF Format)</a>
<li><!WA137><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide204.gif">Slide 204 Another Example (GIF format)</a>
<li><!WA138><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide205.gif">Slide 205 Code For Boyer-Moore (GIF format)</a>
<li><!WA139><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide206.gif">Slide 206 Improving Boyer-Moore (GIF format)</a>
<li><!WA140><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide207.gif">Slide 207 Regular Expressions (To Describe Patterns) (GIF format)</a>
<li><!WA141><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide208.gif">Slide 208 Non-Deterministic Pattern Matching Machines (GIF format)</a>
<li><!WA142><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide209.gif">Slide 209 Non-Deterministic F.S.M. (GIF format)</a>
<li><!WA143><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide210.gif">Slide 210 Deque (GIF format)</a>
<li><!WA144><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide211.gif">Slide 211 Operating a N-D FSM With A Deque (GIF format)</a>
<li><!WA145><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide212.gif">Slide 212 Deque Code (GIF format)</a>
<li><!WA146><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide213.gif">Slide 213 What Is Parsing? (GIF Format)</a>
<li><!WA147><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide214.gif">Slide 214 Example of A Grammar (GIF format)</a>
<li><!WA148><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide215.gif">Slide 215 Example Parse Tree (GIF format)</a>
<li><!WA149><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide216.gif">Slide 216 Grammar For "C" (GIF format)</a>
<li><!WA150><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide217.gif">Slide 217 Parsing Factors (GIF format)</a>
<li><!WA151><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide218.gif">Slide 218 Terms and Expressiona (GIF format)</a>
<li><!WA152><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide219.gif">Slide 219 Parsing Routines in Action (GIF format)</a>
<li><!WA153><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide220.gif">Slide 220 A Simple Compiler (GIF format)</a>
<li><!WA154><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide221.gif">Slide 221 Compiling Factors (GIF format)</a>
<li><!WA155><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide222.gif">Slide 222 Compiling Terms (GIF format)</a>
<li><!WA156><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide223.gif">Slide 223 Compiling Expressions (GIF Format)</a>
<li><!WA157><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide133.gif">Slide 133 Adjacency Matrix (GIF Format)</a>
<li><!WA158><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide134.gif">Slide 134 Adjacency Lists (GIF format)</a>
<li><!WA159><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide135.gif">Slide 135 Depth-First Search (GIF format)</a>
<li><!WA160><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide136.gif">Slide 136 Depth-First Code (GIF format)</a>
<li><!WA161><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide137.gif">Slide 137 Depth-First Search Trees (GIF format)</a>
<li><!WA162><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide138.gif">Slide 138 Breadth-First Code (GIF format)</a>
<li><!WA163><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide139.gif">Slide 139 Breadth-First Example (GIF format)</a>
<li><!WA164><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide140.gif">Slide 140 Biconnectivity Example (GIF format)</a>
<li><!WA165><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide141.gif">Slide 141 Data Structures (GIF format)</a>
<li><!WA166><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide142.gif">Slide 142 Biconnectivity Example (GIF format)</a>
<li><!WA167><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide143.gif">Slide 143 Finding Articulation Points (GIF Format)</a>
<li><!WA168><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide144.gif">Slide 144 Minimum Spanning Trees (GIF format)</a>
<li><!WA169><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide145.gif">Slide 145 Proof of Property (GIF format)</a>
<li><!WA170><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide146.gif">Slide 146 Examples (GIF format)</a>
<li><!WA171><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide147.gif">Slide 147 Minimum Spanning Tree (GIF format)</a>
<li><!WA172><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide148.gif">Slide 148 Notes on Minimum Spanning Tree Code (GIF format)</a>
<li><!WA173><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide149.gif">Slide 149 Minimum Spanning Tree Code (GIF format)</a>
<li><!WA174><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide150.gif">Slide 150 Depth-First Search (GIF format)</a>
<li><!WA175><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide151.gif">Slide 151 Depth-First Search Code (GIF format)</a>
<li><!WA176><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide152.gif">Slide 152 Breadth-First Search (GIF format)</a>
<li><!WA177><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide153.gif">Slide 153 Breadth-First Search Code (GIF Format)</a>
<li><!WA178><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide154.gif">Slide 154 Shortest Path Spanning Tree (GIF format)</a>
<li><!WA179><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide155.gif">Slide 155 Shortest Path Spanning Tree (GIF format)</a>
<li><!WA180><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide156.gif">Slide 156 Shortest Path Spanning Tree Code (GIF format)</a>
<li><!WA181><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide157.gif">Slide 157 Directed Graphs (GIF format)</a>
<li><!WA182><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide158.gif">Slide 158 Transistive Closure (GIF format)</a>
<li><!WA183><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide159.gif">Slide 159 Warshall's Algorithm (GIF format)</a>
<li><!WA184><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide160.gif">Slide 160 All Shortest Paths (GIF format)</a>
<li><!WA185><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide161.gif">Slide 161 Floyd's Algorithm (GIF format)</a>
<li><!WA186><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide162.gif">Slide 162 Introduction to Flow Problems (GIF format)</a>
<li><!WA187><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide163.gif">Slide 163 Max Flow Example (GIF format)</a>
<li><!WA188><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide164.gif">Slide 164 Max Flow Examples (GIF format)</a>
<li><!WA189><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide165.gif">Slide 165 A Linear Program (GIF format)</a>
<li><!WA190><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide166.gif">Slide 166 Change Inequalities to Equalities (GIF format)</a>
<li><!WA191><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide167.gif">Slide 167 Basic Solutions (GIF format)</a>
<li><!WA192><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide168.gif">Slide 168 Listing of Basic Solutions (GIF format)</a>
<li><!WA193><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide169.gif">Slide 169 Procedure (GIF format)</a>
<li><!WA194><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide170.gif">Slide 170 Simplex Method Example (GIF format)</a>
<li><!WA195><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide171.gif">Slide 171 Choosing A Pivot Row (GIF format)</a>
<li><!WA196><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide172.gif">Slide 172 A Gauss-Jordan Iteration (GIF format)</a>
<li><!WA197><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide173.gif">Slide 173 Second Gauss-Jordan Iteration (GIF Format)</a>
<li><!WA198><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide174.gif">Slide 174 Choosing the Pivot Column (GIF format)</a>
<li><!WA199><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide175.gif">Slide 175 More on the Pivot Column (GIF format)</a>
<li><!WA200><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide176.gif">Slide 176 Choosing the Pivot Row (GIF format)</a>
<li><!WA201><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide177.gif">Slide 177 Summary of L.P. Procedure (GIF format)</a>
<li><!WA202><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide178.gif">Slide 178 Another L.P. Example (GIF format)</a>
<li><!WA203><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide179.gif">Slide 179 Continuing (GIF format)</a>
<li><!WA204><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide180.gif">Slide 180 Continuing (GIF format)</a>
<li><!WA205><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide181.gif">Slide 181 Continuing (GIF format)</a>
<li><!WA206><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide182.gif">Slide 182 Linear Congruential Method (GIF format)</a>
<li><!WA207><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide183.gif">Slide 183 Worrying About Overflow (GIF Format)</a>
<li><!WA208><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide184.gif">Slide 184 Peculiarity of L.C. Method (GIF format)</a>
<li><!WA209><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide185.gif">Slide 185 Additive Congruential Method (GIF format)</a>
<li><!WA210><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide186.gif">Slide 186 True Randomness (GIF format)</a>
<li><!WA211><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide187.gif">Slide 187 Chi-Squared Test (GIF format)</a>

</ul>

<hr>

<p>Comments to author: S.C. Bass (<!WA212><a
href="mailto:bass@cse.nd.edu">bass@cse.nd.edu</a>)</address>

<p>Copyright &copy 1996, University of Notre Dame<br>
All rights reserved.</p>

<p>Revised: 15 November, 1996</p>

</body>
